package leetcode.code0056;

import leetcode.IDebug;
import leetcode.helper.HelpDebug;

public abstract class Solution56 implements IDebug {
	public abstract int[][] merge(int[][] intervals);

	@Override
	public void debug1() {
//		String str ="[[1,3],[9,6],[8,10],[15,18]]";
		String str ="[[1,3],[2,6],[8,10],[15,18]]";
		int[][] intervals = HelpDebug.str2array1(str);
		String str1 = "[[1,6],[8,10],[15,18]]";
		int[][] e = HelpDebug.str2array1(str1);
		int[][] r = this.merge(intervals);
		HelpDebug.compare(e, r);

	}

	@Override
	public void debug2() {
		String str ="[[1,4],[4,5]]";
		int[][] intervals = HelpDebug.str2array1(str);
		String str1 = "[[1,5]]";
		int[][] e = HelpDebug.str2array1(str1);
		int[][] r = this.merge(intervals);
		HelpDebug.compare(e, r);
	}

	@Override
	public void debug3() {
		// TODO Auto-generated method stub

	}

	@Override
	public void debug4() {
		// TODO Auto-generated method stub

	}

}
